An Interior-point Method for Semideenite Programming
نویسندگان
چکیده
We propose a new interior point based method to minimize a linear function of a matrix variable subject to linear equality and inequality constraints over the set of positive semideenite matrices. We show that the approach is very eecient for graph bisection problems, such as max-cut. Other applications include max-min eigenvalue problems and relaxations for the stable set problem.
منابع مشابه
An Interior-point Method for Semideenite Programming an Interior-point Method for Semideenite Programming
We propose a new interior point based method to minimize a linear function of a matrix variable subject to linear equality and inequality constraints over the set of positive semideenite matrices. We present a theoretical convergence analysis, and show that the approach is very eecient for graph bisection problems, such as max-cut. The approach can also be applied to max-min eigenvalue problems.
متن کاملComputing Distances between Convex Sets and Subsets of the Positive Semideenite Matrices
We describe an important class of semideenite programming problems that has received scant attention in the optimization community. These problems are derived from considerations in distance geometry and multidimensional scaling and therefore arise in a variety of disciplines, e.g. computational chemistry and psychometrics. In most applications, the feasible positive semideenite matrices are re...
متن کاملB-355 a Note on the Calculation of Step-lengths in Interior-point Methods for Semideenite Programming
In each iteration of an interior-point method for semideenite programming, the maximum step-length that can be taken by the iterate while maintaining the positive semideeniteness constraint need to be estimated. In this note, we show how the maximum step-length can be estimated via the Lanczos iteration, a standard iterative method for estimating the extremal eigenvalues of a matrix. We also gi...
متن کاملSemideenite Programs and Combinatorial Optimization
Outline 1. Introductory examples: Shannon capacity and maximum cuts. 2. Preliminaries: linear programming, semideenite matrices. 3. General properties of semideenite programs: equivalent forms, Farkas Lemma, Duality Theorem, Ellipsoid method, Interior point method. 4. Getting semideenite programs I: eigenvalues of graphs and the method of variables. 5. Getting semideenite programs II: geometric...
متن کاملSemideenite Programs and Combinatorial Optimization
Outline 1. Introductory examples: Shannon capacity and maximum cuts. 2. Preliminaries: linear programming, semideenite matrices. 3. General properties of semideenite programs: equivalent forms, Farkas Lemma, Duality Theorem, Ellipsoid method, Interior point method. 4. Getting semideenite programs I: eigenvalues of graphs and the method of variables. 5. Getting semideenite programs II: geometric...
متن کامل